Container With Most Water

Given n non-negative integers a1, a2, …, an, where each represents a point at coordinate (i, ai). n vertical lines are drawn such that the two endpoints of line i is at (i, ai) and (i, 0). Find two lines, which together with x-axis forms a container, such that the container contains the most water.

Note:

You may not slant the container.

Solution:

public class Solution {
  public int maxArea(int[] height) {
    int n = height.length, max = 0;
    int i = 0, j = n - 1;
    while (i < j) {
      int area = Math.min(height[i], height[j]) * (j - i);
      max = Math.max(max, area);
      if (height[i] < height[j]) {
        i++;
      } else {
        j--;
      }
    }
    return max;
  }
}